Homotopy equivalence of isospectral graphs
نویسندگان
چکیده
In previous work we defined a Quillen model structure, determined by cycles, on the category Gph of directed graphs. In this paper we give a complete description of the homotopy category of graphs associated to our model structure. We endow the categories of N-sets and Z-sets with related model structures, and show that their homotopy categories are Quillen equivalent to the homotopy category Ho(Gph). This enables us to show that Ho(Gph) is equivalent to the category cZSet of periodic Z-sets, and to show that two finite directed graphs are almost-isospectral if and only if they are homotopy-equivalent in our sense.
منابع مشابه
Classification of graphs based on homotopy equivalence. Homotopy equivalent graphs. Basic graphs and complexity of homotopy equivalence classes of graphs
The main concept of this classification is that graphs belonging to the same equivalence class have similar topological properties. Graphs are called homotopy equivalent if one of them can be converted to the other one by contractible transformations. A basic representative and complexity of a homotopy equivalence class are defined and investigated. Finding a basic representative within a homot...
متن کاملIsospectral Graph Transformations, Spectral Equivalence, and Global Stability of Dynamical Networks
Abstract. In this paper we present a general procedure that allows for the reduction or expansion of any network (considered as a weighted graph). This procedure maintains the spectrum of the network’s adjacency matrix up to a set of eigenvalues known beforehand from its graph structure. This procedure can be used to establish new equivalence relations on the class of all weighted graphs (netwo...
متن کاملHom complexes and homotopy in the category of graphs
We investigate a notion of ×-homotopy of graph maps that is based on the internal hom associated to the categorical product in the category of graphs. It is shown that graph ×homotopy is characterized by the topological properties of the Hom complex, a functorial way to assign a poset (and hence topological space) to a pair of graphs; Hom complexes were introduced by Lovász and further studied ...
متن کاملHom complexes and homotopy theory in the category of graphs
We investigate a notion of ×-homotopy of graph maps that is based on the internal hom associated to the categorical product in the category of graphs. It is shown that graph ×homotopy is characterized by the topological properties of the Hom complex, a functorial way to assign a poset (and hence topological space) to a pair of graphs; Hom complexes were introduced by Lovász and further studied ...
متن کاملMilnor Invariants for Spatial Graphs
Link homotopy has been an active area of research for knot theorists since its introduction by Milnor in the 1950s. We introduce a new equivalence relation on spatial graphs called component homotopy, which reduces to link homotopy in the classical case. Unlike previous attempts at generalizing link homotopy to spatial graphs, our new relation allows analogues of some standard link homotopy res...
متن کامل